A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem
نویسندگان
چکیده
منابع مشابه
A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem
We provide a randomized approximation scheme for the k-median problem when the input points lie in the d-dimensional Euclidean space. The running time is O(2 d−1)n log n), which is nearly linear for any fixed ε and d. Moreover our method provides the first polynomial-time approximation scheme for k-median and uncapacitated facility location instances in d-dimensional Euclidean space for any fix...
متن کاملPolynomial - time Approximation Scheme for Euclidean TSP
We present a surprising result that the traveling salesman problem has a polynomial-time approximation scheme when the distances between cities are Euclidean. This result, independently due to Arora and Mitchell [1, 6], hinges on a powerful technique for randomly decomposing the given graph into regions, such that dependency amongst optimal solutions to each region has a “nice” structure. In fa...
متن کاملA constant-factor approximation algorithm for the k-median problem
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those problems in which the aim is to partition a given set of points into clusters so that the points within a cluster are relatively close with respect to some measure. For the metric k-median problem, we are given n poin...
متن کاملNearly Linear Time Approximation Schemes for Euclidean TSP and other Geometric Problems
We present a randomized polynomial time approximation scheme for Euclidean TSP in < 2 that is substantially more eecient than our earlier scheme in 2] (and the scheme of Mitchell 21]). For any xed c > 1 and any set of n nodes in the plane, the new scheme nds a (1+ 1 c)-approximation to the optimum traveling salesman tour in O(n(log n) O(c)) time. (Our earlier scheme ran in n O(c) time.) For poi...
متن کاملA Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity
We present polynomial-time approximation schemes for the problem of finding a minimum-cost k-connected Euclidean graph on a finite point set in R. The cost of an edge in such a graph is equal to the Euclidean distance between its endpoints. Our schemes use Steiner points. For every given c > 1 and a set S of n points in R, a randomized version of our scheme finds an Euclidean graph on a superse...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2007
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539702404055